<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.11"/>
<title>Clause: src/jieba/include/cppjieba/DictTrie.hpp 源文件</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Clause
   &#160;<span id="projectnumber">1.0</span>
   </div>
   <div id="projectbrief">Chatopera Language Understanding Service.</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- 制作者 Doxygen 1.8.11 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'搜索');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>首页</span></a></li>
      <li><a href="pages.html"><span>相关页面</span></a></li>
      <li><a href="modules.html"><span>模块</span></a></li>
      <li><a href="namespaces.html"><span>命名空间</span></a></li>
      <li><a href="annotated.html"><span>类</span></a></li>
      <li class="current"><a href="files.html"><span>文件</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="搜索" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>文件列表</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_fbdfadbb744c948350505e8738791e4e.html">jieba</a></li><li class="navelem"><a class="el" href="dir_efc4309f5a371b59161bd01663dd64b9.html">include</a></li><li class="navelem"><a class="el" href="dir_c6353e5563b4d99e51ccecd6b6f775d1.html">cppjieba</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">DictTrie.hpp</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="preprocessor">#ifndef CPPJIEBA_DICT_TRIE_HPP</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="preprocessor">#define CPPJIEBA_DICT_TRIE_HPP</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="preprocessor">#include &lt;iostream&gt;</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="preprocessor">#include &lt;fstream&gt;</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="preprocessor">#include &lt;map&gt;</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="preprocessor">#include &lt;string&gt;</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="preprocessor">#include &lt;cstring&gt;</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="preprocessor">#include &lt;cstdlib&gt;</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="preprocessor">#include &lt;stdint.h&gt;</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="preprocessor">#include &lt;cmath&gt;</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="preprocessor">#include &lt;limits&gt;</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="preprocessor">#include &quot;glog/logging.h&quot;</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="preprocessor">#include &quot;StringUtils.hpp&quot;</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="preprocessor">#include &quot;Unicode.hpp&quot;</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="preprocessor">#include &quot;Trie.hpp&quot;</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespacecppjieba.html">cppjieba</a> {</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="keyword">using namespace </span><a class="code" href="namespacechatopera_1_1utils.html">chatopera::utils</a>;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="keyword">const</span> <span class="keywordtype">double</span> MIN_DOUBLE = -3.14e+100;</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="keyword">const</span> <span class="keywordtype">double</span> MAX_DOUBLE = 3.14e+100;</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="keyword">const</span> <span class="keywordtype">size_t</span> DICT_COLUMN_NUM = 3;</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="keyword">const</span> <span class="keywordtype">char</span>* <span class="keyword">const</span> UNKNOWN_TAG = <span class="stringliteral">&quot;&quot;</span>;</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;</div><div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="classcppjieba_1_1DictTrie.html">   27</a></span>&#160;<span class="keyword">class </span><a class="code" href="classcppjieba_1_1DictTrie.html">DictTrie</a> {</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160; <span class="keyword">public</span>:</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;  <span class="keyword">enum</span> UserWordWeightOption {</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;    WordWeightMin,</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;    WordWeightMedian,</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;    WordWeightMax,</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;  }; <span class="comment">// enum UserWordWeightOption</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;  <a class="code" href="classcppjieba_1_1DictTrie.html">DictTrie</a>(<span class="keyword">const</span> <span class="keywordtype">string</span>&amp; dict_path, <span class="keyword">const</span> <span class="keywordtype">string</span>&amp; user_dict_paths = <span class="stringliteral">&quot;&quot;</span>, UserWordWeightOption user_word_weight_opt = WordWeightMedian) {</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;    Init(dict_path, user_dict_paths, user_word_weight_opt);</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;  }</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;  ~<a class="code" href="classcppjieba_1_1DictTrie.html">DictTrie</a>() {</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="keyword">delete</span> trie_;</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;  }</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;  <span class="keywordtype">bool</span> InsertUserWord(<span class="keyword">const</span> <span class="keywordtype">string</span>&amp; word, <span class="keyword">const</span> <span class="keywordtype">string</span>&amp; tag = UNKNOWN_TAG) {</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;    <a class="code" href="structcppjieba_1_1DictUnit.html">DictUnit</a> node_info;</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;    <span class="keywordflow">if</span> (!MakeNodeInfo(node_info, word, user_word_default_weight_, tag)) {</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;      <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;    }</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    active_node_infos_.push_back(node_info);</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;    trie_-&gt;InsertNode(node_info.word, &amp;active_node_infos_.back());</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;  }</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;  <span class="keywordtype">bool</span> InsertUserWord(<span class="keyword">const</span> <span class="keywordtype">string</span>&amp; word, <span class="keywordtype">int</span> freq, <span class="keyword">const</span> <span class="keywordtype">string</span>&amp; tag = UNKNOWN_TAG) {</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;    <a class="code" href="structcppjieba_1_1DictUnit.html">DictUnit</a> node_info;</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;    <span class="keywordtype">double</span> weight = freq ? log(1.0 * freq / freq_sum_) : user_word_default_weight_ ;</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;    <span class="keywordflow">if</span> (!MakeNodeInfo(node_info, word, weight, tag)) {</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;      <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;    }</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;    active_node_infos_.push_back(node_info);</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;    trie_-&gt;InsertNode(node_info.word, &amp;active_node_infos_.back());</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;  }</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;  <span class="keyword">const</span> <a class="code" href="structcppjieba_1_1DictUnit.html">DictUnit</a>* Find(RuneStrArray::const_iterator begin, RuneStrArray::const_iterator end)<span class="keyword"> const </span>{</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;    <span class="keywordflow">return</span> trie_-&gt;Find(begin, end);</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;  }</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;  <span class="keywordtype">void</span> Find(RuneStrArray::const_iterator begin,</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;            RuneStrArray::const_iterator end,</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;            vector&lt;struct Dag&gt;&amp;res,</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;            <span class="keywordtype">size_t</span> max_word_len = MAX_WORD_LENGTH)<span class="keyword"> const </span>{</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;    trie_-&gt;Find(begin, end, res, max_word_len);</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;  }</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;  <span class="keywordtype">bool</span> Find(<span class="keyword">const</span> <span class="keywordtype">string</span>&amp; word) {</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;    <span class="keyword">const</span> <a class="code" href="structcppjieba_1_1DictUnit.html">DictUnit</a> *tmp = NULL;</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;    <a class="code" href="classlimonp_1_1LocalVector.html">RuneStrArray</a> runes;</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;    <span class="keywordflow">if</span> (!DecodeRunesInString(word, runes)) {</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;      VLOG(2) &lt;&lt; <span class="stringliteral">&quot;Decode failed.&quot;</span>;</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;    }</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    tmp = Find(runes.begin(), runes.end());</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;    <span class="keywordflow">if</span> (tmp == NULL) {</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;      <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;    } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;      <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;    }</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;  }</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;  <span class="keywordtype">bool</span> IsUserDictSingleChineseWord(<span class="keyword">const</span> Rune&amp; word)<span class="keyword"> const </span>{</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;    <span class="keywordflow">return</span> IsIn(user_dict_single_chinese_word_, word);</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;  }</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;  <span class="keywordtype">double</span> GetMinWeight()<span class="keyword"> const </span>{</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;    <span class="keywordflow">return</span> min_weight_;</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;  }</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;  <span class="keywordtype">void</span> InserUserDictNode(<span class="keyword">const</span> <span class="keywordtype">string</span>&amp; line) {</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;    vector&lt;string&gt; buf;</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;    <a class="code" href="structcppjieba_1_1DictUnit.html">DictUnit</a> node_info;</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;    Split(line, buf, <span class="stringliteral">&quot; &quot;</span>);</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;    <span class="keywordflow">if</span>(buf.size() == 1) {</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;      MakeNodeInfo(node_info,</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;                   buf[0],</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;                   user_word_default_weight_,</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;                   UNKNOWN_TAG);</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (buf.size() == 2) {</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;      MakeNodeInfo(node_info,</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;                   buf[0],</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;                   user_word_default_weight_,</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;                   buf[1]);</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (buf.size() == 3) {</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;      <span class="keywordtype">int</span> freq = atoi(buf[1].c_str());</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;      assert(freq_sum_ &gt; 0.0);</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;      <span class="keywordtype">double</span> weight = log(1.0 * freq / freq_sum_);</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;      MakeNodeInfo(node_info, buf[0], weight, buf[2]);</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;    }</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;    static_node_infos_.push_back(node_info);</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;    <span class="keywordflow">if</span> (node_info.word.size() == 1) {</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;      user_dict_single_chinese_word_.insert(node_info.word[0]);</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;    }</div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;  }</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;  <span class="keywordtype">void</span> LoadUserDict(<span class="keyword">const</span> vector&lt;string&gt;&amp; buf) {</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; buf.size(); i++) {</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;      InserUserDictNode(buf[i]);</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;    }</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;  }</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;  <span class="keywordtype">void</span> LoadUserDict(<span class="keyword">const</span> set&lt;string&gt;&amp; buf) {</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;    std::set&lt;string&gt;::const_iterator iter;</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;    <span class="keywordflow">for</span> (iter = buf.begin(); iter != buf.end(); iter++) {</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;      InserUserDictNode(*iter);</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;    }</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;  }</div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;  <span class="keywordtype">void</span> LoadUserDict(<span class="keyword">const</span> <span class="keywordtype">string</span>&amp; filePaths) {</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;    vector&lt;string&gt; files = Split(filePaths, <span class="stringliteral">&quot;|;&quot;</span>);</div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;    <span class="keywordtype">size_t</span> lineno = 0;</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; files.size(); i++) {</div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;      ifstream ifs(files[i].c_str());</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;      CHECK(ifs.is_open()) &lt;&lt; <span class="stringliteral">&quot;open &quot;</span> &lt;&lt; files[i] &lt;&lt; <span class="stringliteral">&quot; failed&quot;</span>;</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;      <span class="keywordtype">string</span> line;</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;      <span class="keywordflow">for</span> (; getline(ifs, line); lineno++) {</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;        <span class="keywordflow">if</span> (line.size() == 0) {</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;          <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;        }</div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;        InserUserDictNode(line);</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;      }</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;    }</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;  }</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160; <span class="keyword">private</span>:</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;  <span class="keywordtype">void</span> Init(<span class="keyword">const</span> <span class="keywordtype">string</span>&amp; dict_path, <span class="keyword">const</span> <span class="keywordtype">string</span>&amp; user_dict_paths, UserWordWeightOption user_word_weight_opt) {</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;    LoadDict(dict_path);</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;    freq_sum_ = CalcFreqSum(static_node_infos_);</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;    CalculateWeight(static_node_infos_, freq_sum_);</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;    SetStaticWordWeights(user_word_weight_opt);</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;    <span class="keywordflow">if</span> (user_dict_paths.size()) {</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;      LoadUserDict(user_dict_paths);</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;    }</div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;    Shrink(static_node_infos_);</div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;    CreateTrie(static_node_infos_);</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;  }</div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;</div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;  <span class="keywordtype">void</span> CreateTrie(<span class="keyword">const</span> vector&lt;DictUnit&gt;&amp; dictUnits) {</div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;    assert(dictUnits.size());</div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;    vector&lt;Unicode&gt; words;</div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;    vector&lt;const DictUnit*&gt; valuePointers;</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0 ; i &lt; dictUnits.size(); i ++) {</div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;      words.push_back(dictUnits[i].word);</div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;      valuePointers.push_back(&amp;dictUnits[i]);</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;    }</div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;</div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;    trie_ = <span class="keyword">new</span> <a class="code" href="classcppjieba_1_1Trie.html">Trie</a>(words, valuePointers);</div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;  }</div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;</div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;</div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;</div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;  <span class="keywordtype">bool</span> MakeNodeInfo(<a class="code" href="structcppjieba_1_1DictUnit.html">DictUnit</a>&amp; node_info,</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;                    <span class="keyword">const</span> <span class="keywordtype">string</span>&amp; word,</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;                    <span class="keywordtype">double</span> weight,</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;                    <span class="keyword">const</span> <span class="keywordtype">string</span>&amp; tag) {</div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;    <span class="keywordflow">if</span> (!DecodeRunesInString(word, node_info.word)) {</div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;      VLOG(2) &lt;&lt; <span class="stringliteral">&quot;Decode &quot;</span> &lt;&lt; word &lt;&lt; <span class="stringliteral">&quot; failed.&quot;</span>;</div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;      <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;    }</div><div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;</div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;    node_info.weight = weight;</div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;    node_info.tag = tag;</div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;  }</div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;</div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;  <span class="keywordtype">void</span> LoadDict(<span class="keyword">const</span> <span class="keywordtype">string</span>&amp; filePath) {</div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;    ifstream ifs(filePath.c_str());</div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;    CHECK(ifs.is_open()) &lt;&lt; <span class="stringliteral">&quot;open &quot;</span> &lt;&lt; filePath &lt;&lt; <span class="stringliteral">&quot; failed.&quot;</span>;</div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;    <span class="keywordtype">string</span> line;</div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;    vector&lt;string&gt; buf;</div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;</div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;    <a class="code" href="structcppjieba_1_1DictUnit.html">DictUnit</a> node_info;</div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;</div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> lineno = 0; getline(ifs, line); lineno++) {</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;      Split(line, buf, <span class="stringliteral">&quot; &quot;</span>);</div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;      CHECK(buf.size() == DICT_COLUMN_NUM) &lt;&lt; <span class="stringliteral">&quot;split result illegal, line:&quot;</span> &lt;&lt; line;</div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;      MakeNodeInfo(node_info,</div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;                   buf[0],</div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;                   atof(buf[1].c_str()),</div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;                   buf[2]);</div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;      static_node_infos_.push_back(node_info);</div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;    }</div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;  }</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;</div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;  <span class="keyword">static</span> <span class="keywordtype">bool</span> WeightCompare(<span class="keyword">const</span> <a class="code" href="structcppjieba_1_1DictUnit.html">DictUnit</a>&amp; lhs, <span class="keyword">const</span> <a class="code" href="structcppjieba_1_1DictUnit.html">DictUnit</a>&amp; rhs) {</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;    <span class="keywordflow">return</span> lhs.weight &lt; rhs.weight;</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;  }</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;</div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;  <span class="keywordtype">void</span> SetStaticWordWeights(UserWordWeightOption option) {</div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;    CHECK(!static_node_infos_.empty());</div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;    vector&lt;DictUnit&gt; x = static_node_infos_;</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;    sort(x.begin(), x.end(), WeightCompare);</div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;    min_weight_ = x[0].weight;</div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;    max_weight_ = x[x.size() - 1].weight;</div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;    median_weight_ = x[x.size() / 2].weight;</div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;</div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;    <span class="keywordflow">switch</span> (option) {</div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;      <span class="keywordflow">case</span> WordWeightMin:</div><div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;        user_word_default_weight_ = min_weight_;</div><div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;        <span class="keywordflow">break</span>;</div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;</div><div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;      <span class="keywordflow">case</span> WordWeightMedian:</div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;        user_word_default_weight_ = median_weight_;</div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;        <span class="keywordflow">break</span>;</div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;</div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;      <span class="keywordflow">default</span>:</div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;        user_word_default_weight_ = max_weight_;</div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;        <span class="keywordflow">break</span>;</div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;    }</div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;  }</div><div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;</div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;  <span class="keywordtype">double</span> CalcFreqSum(<span class="keyword">const</span> vector&lt;DictUnit&gt;&amp; node_infos)<span class="keyword"> const </span>{</div><div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;    <span class="keywordtype">double</span> sum = 0.0;</div><div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;</div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; node_infos.size(); i++) {</div><div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;      sum += node_infos[i].weight;</div><div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;    }</div><div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;</div><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;    <span class="keywordflow">return</span> sum;</div><div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;  }</div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;</div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;  <span class="keywordtype">void</span> CalculateWeight(vector&lt;DictUnit&gt;&amp; node_infos, <span class="keywordtype">double</span> sum)<span class="keyword"> const </span>{</div><div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;    assert(sum &gt; 0.0);</div><div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;</div><div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; node_infos.size(); i++) {</div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;      <a class="code" href="structcppjieba_1_1DictUnit.html">DictUnit</a>&amp; node_info = node_infos[i];</div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;      assert(node_info.weight &gt; 0.0);</div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;      node_info.weight = log(<span class="keywordtype">double</span>(node_info.weight) / sum);</div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;    }</div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;  }</div><div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;</div><div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;  <span class="keywordtype">void</span> Shrink(vector&lt;DictUnit&gt;&amp; units)<span class="keyword"> const </span>{</div><div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;    vector&lt;DictUnit&gt;(units.begin(), units.end()).swap(units);</div><div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;  }</div><div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;</div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;  vector&lt;DictUnit&gt; static_node_infos_;</div><div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;  deque&lt;DictUnit&gt; active_node_infos_; <span class="comment">// must not be vector</span></div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;  <a class="code" href="classcppjieba_1_1Trie.html">Trie</a> * trie_;</div><div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;</div><div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;  <span class="keywordtype">double</span> freq_sum_;</div><div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;  <span class="keywordtype">double</span> min_weight_;</div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;  <span class="keywordtype">double</span> max_weight_;</div><div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;  <span class="keywordtype">double</span> median_weight_;</div><div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;  <span class="keywordtype">double</span> user_word_default_weight_;</div><div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;  unordered_set&lt;Rune&gt; user_dict_single_chinese_word_;</div><div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;};</div><div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;}</div><div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;</div><div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;<span class="preprocessor">#endif</span></div><div class="ttc" id="classlimonp_1_1LocalVector_html"><div class="ttname"><a href="classlimonp_1_1LocalVector.html">limonp::LocalVector&lt; struct RuneStr &gt;</a></div></div>
<div class="ttc" id="namespacecppjieba_html"><div class="ttname"><a href="namespacecppjieba.html">cppjieba</a></div><div class="ttdef"><b>Definition:</b> DictTrie.hpp:18</div></div>
<div class="ttc" id="structcppjieba_1_1DictUnit_html"><div class="ttname"><a href="structcppjieba_1_1DictUnit.html">cppjieba::DictUnit</a></div><div class="ttdef"><b>Definition:</b> Trie.hpp:15</div></div>
<div class="ttc" id="namespacechatopera_1_1utils_html"><div class="ttname"><a href="namespacechatopera_1_1utils.html">chatopera::utils</a></div><div class="ttdef"><b>Definition:</b> MathUtils.hpp:21</div></div>
<div class="ttc" id="classcppjieba_1_1DictTrie_html"><div class="ttname"><a href="classcppjieba_1_1DictTrie.html">cppjieba::DictTrie</a></div><div class="ttdef"><b>Definition:</b> DictTrie.hpp:27</div></div>
<div class="ttc" id="classcppjieba_1_1Trie_html"><div class="ttname"><a href="classcppjieba_1_1Trie.html">cppjieba::Trie</a></div><div class="ttdef"><b>Definition:</b> Trie.hpp:51</div></div>
</div><!-- fragment --></div><!-- contents -->
<address class="footer">
    <small>
        &nbsp; Copyright (c) (2019-2020) &nbsp;<a href="https://www.chatopera.com">
            北京华夏春松科技有限公司
        </a>. All Rights Reserved
        &nbsp;
    </small>
</address>